Solving multi-objective master production schedule problem using memetic algorithm
نویسندگان
چکیده
منابع مشابه
One-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm
Abstract— Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension Multi-Objective Bin Packing Problem. Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. In t...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملOn solving multi-objective bin packing problems using memetic algorithms
The bin-packing problem (BPP) and its multi-dimensional variants have many practical applications, such as packing objects in boxes, production planning, multiprocessor scheduling, etc. The classical singleobjective formulation of the two-dimensional bin packing (2D-BPP) consists of packing a set of objects (pieces) in the minimum number of bins (containers). This paper presents a new Pareto-ba...
متن کاملMulti-Objective Memetic Algorithm using Pattern Search Filter Methods
Solving real world Multi-Objective Optimization Problems (MOOP) often involves the use of complex “black-box ”modeling routines, where the resolution of the process governing equations requires the use of expensive numerical methods [1]. Multi-Objective Evolutionary Algorithms (MOEA) is an excellent tool to deal with the multi-objective nature of these problems. They do not need the calculation...
متن کاملMulti-Objective Optimization of Standard Cell Placement using Memetic Algorithm
Beyond the optimization of single parameter (usually the wire-length) in Standard Cell Placement (SCP), focus in the present work is laid on the optimization of speed, power, and the wire length. As discussed in our previous work of hybrid algorithms for single objective optimization of SCP the main advantage of hybridization is the improvement in convergence speed to Pareto front although it l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2020
ISSN: 2502-4760,2502-4752
DOI: 10.11591/ijeecs.v18.i2.pp938-945